Algorithmic Derivation of Additive Selection Rules and Particle Families from Reaction Data

نویسنده

  • Oliver Schulte
چکیده

We describe a machine-learning system that uses linear vector-space based techniques for inference from observations to extend previous work on model construction for particle physics [10, 9, 5]. The program searches for quantities conserved in all reactions from a given input set; given data based on frequent decays it rediscovers the family conservation laws: baryon#, electron#, muon# and tau#. We show that these families are uniquely determined by frequent decay data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithmic Proof That The Family Conservation Laws Are Optimal For the Current Reaction Data

We describe a machine-learning system that uses linear vector-space based techniques for inference from observations to extend previous work on model construction for particle physics [11, 10, 6]. The program searches for quantities conserved in all reactions from a given input set; given current data it rediscovers the family conservation laws: baryon#, electron#, muon# and tau#. We show that ...

متن کامل

Investigation of the effective factors on manufacturing calcium phosphates prototypes using 3D printing

Calcium phosphate ceramics has been widely used in the present due to their chemical similarity to bone and good biocompatibility in the physiological environmental and a compatibility with synthetic and natural polymers Recent advancements in additive manufacturing have enabled the fabrication of 3D prototypes with controlled architecture resembling the natural bone. Binder jetting is a versat...

متن کامل

Super- and sub-additive transformations of aggregation functions from the point of view of approximation

The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.

متن کامل

On Identities with Additive Mappings in Rings

begin{abstract} If $F,D:Rto R$ are additive mappings which satisfy $F(x^{n}y^{n})=x^nF(y^{n})+y^nD(x^{n})$ for all $x,yin R$. Then, $F$ is a generalized left derivation with associated Jordan left derivation $D$ on $R$. Similar type of result has been done for the other identity forcing to generalized derivation and at last an example has given in support of the theorems. end{abstract}

متن کامل

An Additive Weighted Fuzzy Programming for Supplier Selection Problem in a Supply Chain

  Supplier selection is one of the most important activities of purchasing departments. This importance is increased even more by new strategies in a supply chain, because of the key role suppliers perform in terms of quality, costs and services which affect the outcome in the buyer’s company. Supplier selection is a multiple criteria decision making problem in which the objectives are not equa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007